| 翻訳と辞書 |
| graph enumeration ： ウィキペディア英語版 |
graph enumeration
In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the graph. These problems may be solved either exactly (as an algebraic enumeration problem) or asymptotically.
The pioneers in this area of mathematics were Pólya,〔Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68 (1937), 145-254〕 Cayley and Redfield.〔The theory of group-reduced distributions. American J. Math. 49 (1927), 433-455.〕
==Labeled vs unlabeled problems==
In some graphical enumeration problems, the vertices of the graph are considered to be ''labeled'' in such a way as to be distinguishable from each other, while in other problems any permutation of the vertices is considered to form the same graph. In general, labeled problems tend to be easier to solve than unlabeled problems.〔Harary and Palmer, p. 1.〕 As with combinatorial enumeration more generally, the Pólya enumeration theorem is an important tool for dealing with symmetries such as this.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「graph enumeration」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|